In search for good Chebyshev lattices
نویسندگان
چکیده
Recently we introduced a new framework to describe some point sets used for multivariate integration and approximation [3], which we called Chebyshev lattices. The associated integration rules are equal weight rules, with corrections for the points on the boundary. In this text we detail the development of exhaustive search algorithms for good Chebyshev lattices where the cost of the rules, i.e., the number of points needed for a certain degree of exactness, is used as criterium. Almost loopless algorithms are considered to avoid dependencies on the rank of the Chebyshev lattice and the dimension. Also, several optimisations are applied: reduce the vast search space by exploiting symmetries, lower the cost of the point set creation and minimise the cost of the degree verification. The concluding summary of the search results indicates that higher rank rules in general are better and that the blending formulae due to Godzina lead to the best rules within the class of Chebyshev lattice rules: no better rules have been found in the searches conducted in up to 5 dimensions.
منابع مشابه
Fast, exact and stable reconstruction of multivariate algebraic polynomials in Chebyshev form
We describe a fast method for the evaluation of an arbitrary high-dimensional multivariate algebraic polynomial in Chebyshev form at the nodes of an arbitrary rank-1 Chebyshev lattice. Our main focus is on conditions on rank-1 Chebyshev lattices allowing for the exact reconstruction of such polynomials from samples along such lattices and we present an algorithm for constructing suitable rank-1...
متن کاملThe Petrov-Galerkin Method and Chebyshev Multiwavelet Basis for Solving Integro-Differential Equations
Abstract: There are some methods for solving integro-differential equations. In this work, we solve the general-order Feredholm integro-differential equations. The Petrov-Galerkin method by considering Chebyshev multiwavelet basis is used. By using the orthonormality property of basis elements in discretizing the equation, we can reduce an equation to a linear system with small dimension. For ...
متن کاملDevelopment of an Efficient Hybrid Method for Motif Discovery in DNA Sequences
This work presents a hybrid method for motif discovery in DNA sequences. The proposed method called SPSO-Lk, borrows the concept of Chebyshev polynomials and uses the stochastic local search to improve the performance of the basic PSO algorithm as a motif finder. The Chebyshev polynomial concept encourages us to use a linear combination of previously discovered velocities beyond that proposed b...
متن کاملRegularity in residuated lattices
In this paper, we study residuated lattices in order to give new characterizations for dense, regular and Boolean elements in residuated lattices and investigate special residuated lattices in order to obtain new characterizations for the directly indecomposable subvariety of Stonean residuated lattices. Free algebra in varieties of Stonean residuated lattices is constructed. We introduce in re...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011